Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar3/ZantemaSLASHz21.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f₂(f₂(a, b), x) -> f₂(a, f₂(a, x))
f₂(f₂(b, a), x) -> f₂(b, f₂(b, x))
f₂(x, f₂(y, z)) -> f₂(f₂(x, y), z)

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f₂(f₂(a, b), x) -> f₂(a, f₂(a, x))
f₂(f₂(b, a), x) -> f₂(b, f₂(b, x))
f₂(x, f₂(y, z)) -> f₂(f₂(x, y), z)

Q is empty.

Q DP problem:
The TRS P consists of the following rules:

F₂(x, f₂(y, z)) -> F₂(x, y)
F₂(f₂(b, a), x) -> F₂(b, x)
F₂(f₂(a, b), x) -> F₂(a, x)
F₂(x, f₂(y, z)) -> F₂(f₂(x, y), z)
F₂(f₂(b, a), x) -> F₂(b, f₂(b, x))
F₂(f₂(a, b), x) -> F₂(a, f₂(a, x))

The TRS R consists of the following rules:

f₂(f₂(a, b), x) -> f₂(a, f₂(a, x))
f₂(f₂(b, a), x) -> f₂(b, f₂(b, x))
f₂(x, f₂(y, z)) -> f₂(f₂(x, y), z)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₂(x, f₂(y, z)) -> F₂(x, y)
F₂(f₂(b, a), x) -> F₂(b, x)
F₂(f₂(a, b), x) -> F₂(a, x)
F₂(x, f₂(y, z)) -> F₂(f₂(x, y), z)
F₂(f₂(b, a), x) -> F₂(b, f₂(b, x))
F₂(f₂(a, b), x) -> F₂(a, f₂(a, x))

The TRS R consists of the following rules:

f₂(f₂(a, b), x) -> f₂(a, f₂(a, x))
f₂(f₂(b, a), x) -> f₂(b, f₂(b, x))
f₂(x, f₂(y, z)) -> f₂(f₂(x, y), z)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.